1,275 research outputs found

    Multi-Party Coordination in the Context of MOWS

    Get PDF
    Separation of concerns has been presented as a promising tool to tackle the design of complex systems in which cross-cutting properties that do not fit into the scope of a class must be satisfied. In this paper, we show that interactions amongst a number of objects can also be described separately from functionality, which enhances reusability of functional code and interaction patterns. We present our proposal in the context of Multi-Qrganisational Web-Based Systems (MOWS) and also present a framework that provides the infrastructure needed to implement multiparty coordination as an independent aspect

    Aspect-oriented interaction in multi-organisational web-based systems

    Get PDF
    Separation of concerns has been presented as a promising tool to tackle the design of complex systems in which cross-cutting properties that do not fit into the scope of a class must be satisfied. Unfortunately, current proposals assume that objects interact by means of object-oriented method calls, which implies that they embed interactions with others into their functional code. This makes them dependent on this interaction model, and makes it difficult to reuse them in a context in which another interaction model is more suited, e.g., tuple spaces, multiparty meetings, ports, and so forth. In this paper, we show that functionality can be described separately from the interaction model used, which helps enhance reusability of functional code and coordination patterns. Our proposal is innovative in that it is the first that achieves a clear separation between functionality and interaction in an aspect-oriented manner. In order to show that it is feasible, we adapted the multiparty interaction model to the context of multiorganisational web-based systems and developed a class framework to build business objects whose performance rates comparably to handmade implementations; the development time, however, decreases significantly.Comisión Interministerial de Ciencia y Tecnología TIC2000-1106-C02-0

    A Physical Layer Model for G3-PLC Networks Simulation

    Get PDF
    This work presents a model of the G3-PLC physical (PHY) layer tailored for network simulations. It allows simulating frequency selective channels with non-stationary colored noise. Collisions with other frames are modeled taking into account the length and the power of the interfering frames. Frame errors are estimated using the effective signal-to-interference-and-noise ratio mapping (ESM) function. The proposed PHY layer has been integrated into a distributed event-based simulator developed by Microchip. The layer 2+ stack of the simulator uses the same code that actual Microchip G3-PLC devices. Validation has been accomplished by comparing its results to a test network deployed in the laboratory. The latter consists of a coordinator and one hundred meters distributed in 5 levels. Faster-than-real-time simulations and an excellent agreement between the simulated and the measured performance indicators at the application layer have been obtained.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

    QoS-Aware Semantic Service Selection: An Optimization Problem

    Get PDF
    In order to select the best suited service among a set of discovered services, with respect to QOS parameters, a user have to state his or her preferences, so services can be ranked according to these QOS parameters. Current Se- mantic Web Services ontologies do not support the defini- tion of QOS-aware user preferences, though there are some proposals that extend those ontologies to allow selection based on those preferences. However, their selection algo- rithms are very coupled with user preferences descriptions, which are defined without semantics or at a different seman- tic level than service functionality. In this work, we present a service selection framework that transforms user prefer- ences into an optimization problem where the best service is selected. This framework is based on an ontology that conceptualizes these user preferences. Thus, we use a very expressive solution decoupled with the concrete selection technique by using XSL transformations, while describing QOS-aware user preferences at the same semantic level of functional preferences.Comisión Interministerial de Ciencia y Tecnología TIN2006-00472Junta de Andalucía TIC-253

    Spectrum-Based Fault Localization in Model Transformations

    Get PDF
    Model transformations play a cornerstone role in Model-Driven Engineering (MDE), as they provide the essential mechanisms for manipulating and transforming models. The correctness of software built using MDE techniques greatly relies on the correctness of model transformations. However, it is challenging and error prone to debug them, and the situation gets more critical as the size and complexity of model transformations grow, where manual debugging is no longer possible. Spectrum-Based Fault Localization (SBFL) uses the results of test cases and their corresponding code coverage information to estimate the likelihood of each program component (e.g., statements) of being faulty. In this article we present an approach to apply SBFL for locating the faulty rules in model transformations. We evaluate the feasibility and accuracy of the approach by comparing the effectiveness of 18 different stateof- the-art SBFL techniques at locating faults in model transformations. Evaluation results revealed that the best techniques, namely Kulcynski2, Mountford, Ochiai, and Zoltar, lead the debugger to inspect a maximum of three rules to locate the bug in around 74% of the cases. Furthermore, we compare our approach with a static approach for fault localization in model transformations, observing a clear superiority of the proposed SBFL-based method.Comisión Interministerial de Ciencia y Tecnología TIN2015-70560-RJunta de Andalucía P12-TIC-186

    Virtual-physical registers

    Get PDF
    A novel dynamic register renaming approach is proposed in this work. The key idea of the novel scheme is to delay the allocation of physical registers until a late stage in the pipeline, instead of doing it in the decode stage as conventional schemes do. In this way, the register pressure is reduced and the processor can exploit more instruction-level parallelism. Delaying the allocation of physical registers require some additional artifact to keep track of dependences. This is achieved by introducing the concept of virtual-physical registers, which do not require any storage location and are used to identify dependences among instructions that have not yet allocated a register to its destination operand. Two alternative allocation strategies have been investigated that differ in the stage where physical registers are allocated: issue or write-back. The experimental evaluation has confirmed the higher performance of the latter alternative. We have performed all evaluation of the novel scheme through a detailed simulation of a dynamically scheduled processor. The results show a significant improvement (e.g., 19% increase in IPC for a machine with 64 physical registers in each file) when compared with the traditional register renaming approach.Peer ReviewedPostprint (published version

    Improving Semantic Web Services Discovery Using SPARQL-Based Repository Filtering

    Get PDF
    Semantic Web Services discovery is commonly a heavyweight task, which has scalability issues when the number of services or the ontology complexity increase, because most approaches are based on Description Logics reasoning. As a higher number of services becomes available, there is a need for solutions that improve discovery performance. Our proposal tackles this scalability problem by adding a preprocessing stage based on two SPARQL queries that filter service repositories, discarding service descriptions that do not refer to any functionality or non-functional aspect requested by the user before the actual discovery takes place. This approach fairly reduces the search space for discovery mechanisms, consequently improving the overall performance of this task. Furthermore, this particular solution does not provide yet another discovery mechanism, but it is easily applicable to any of the existing ones, as our prototype evaluation shows. Moreover, proposed queries are automatically generated from service requests, transparently to the user. In order to validate our proposal, this article showcases an application to the OWL-S ontology, in addition to a comprehensive performance analysis that we carried out in order to test and compare the results obtained from proposed filters and current discovery approaches, discussing the benefits of our proposal

    SOA4 All Integrated Ranking: a Preference-Based, Holistic Implementation

    Get PDF
    There exist many available service ranking implementations, each one providing ad hoc preference models that offer different levels of expressiveness. Consequently, applying a single implementation to a particular scenario constrains the user to define preferences based on the underlying formalisms. Furthermore, preferences from different ranking implementation’s model cannot be combined in general, due to interoperability issues. in this article we present an integrated ranking implementation that enables the combination of three different ranking implementations developed within the EU FP7 SOA4All project. Our solution has been developed using PURI, a Preference-based Universal Ranking Integration framework that is based on a common, holistic preference model that allows to exploit synergies from the integrated ranking implementations, offering a single user interface to define preferences that acts as a façade to the integrated ranking implementation

    GEANT4 application for the simulation of the head of a siemens primus linac

    Get PDF
    The Monte Carlo simulation of the head of a Siemens Primus Linac used at Virgen Macarena Hospital (Sevilla, Spain) has been performed using the code GEANT4 [1-2], version 9.2. In this work, the main features of the application built by our group are presented. They are mainly focused in the optimization of the performance of the simulation. The geometry, including the water phantom, has been entirely wrapped by a shielding volume which discards all the particles escaping far away through its walls. With this, a factor of four in the time spent by the simulation can be saved. An interface to read and write phase-space files in IAEA format has been also developed to save CPU time in our simulations [3-4]. Finally, some calculations of the dose absorption in the water phantom have been done and compared with the results given by EGSnrc [5] and with experimental data obtained for the calibration of the machine
    corecore